Confusion-based entropy-weighted decoding for robust speech recognition

نویسندگان

  • Yi Chen
  • Chia-Yu Wan
  • Lin-Shan Lee
چکیده

An entropy-based feature parameter weighting scheme was proposed previously [1], in which the scores obtained from different feature parameters are weighted differently in the decoding process according to an entropy measure. In this paper, we propose a more delicate entropy measure for this purpose considering the inherent confusion among different acoustic classes. If a set of acoustic classes are easily confused, those feature parameters which can distinguish them should be emphasized. Extensive experiments with the Aurora 2 testing environment verified that this approach is equally useful for different types of features, and can be easily integrated with typical existing robust speech recognition approaches.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Search Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes

In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...

متن کامل

Search Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes

In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...

متن کامل

IMPROVED HMM ENTROPY FOR ROBUST SUB−BAND SPEECH RECOGNITION (ThuPmOR1)

In recent years, sub−band speech recognition has been found useful in robust speech recognition, especially for speech signals contaminated by band−limited noise. In sub−band speech recognition, full band speech is divided into several frequency sub−bands and then sub−band feature vectors or their generated likelihoods by corresponding sub−band recognizers are combined to give the result of rec...

متن کامل

Issues with uncertainty decoding for noise robust speech recognition

Recently there has been interest in uncertainty decoding for robust speech recognition. Here the uncertainty associated with the observation in noise is propagated to the recogniser. By using appropriate approximations for this uncertainty, it is possible to obtain efficient implementations during decoding. The aim of these schemes is to obtain performance which is close to that of a modelbased...

متن کامل

A Simplified Decoding Method for a Robust Distant-talking Asr Concept Based on Feature-domain Dereverberation

A simplified decoding method for the concept of REverberation MOdeling for Speech recognition (REMOS) [1] is proposed. In order to achieve robust distant-talking Automatic Speech Recognition (ASR), the REMOS concept uses a combination of clean-speech HMMs and a reverberation model to perform feature-domain dereverberation during decoding. The simplified decoding/dereverberation method proposed ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008